Overrelaxation algorithm for coupled gauge-Higgs systems
نویسندگان
چکیده
منابع مشابه
99 4 DESY 94 - 046 ISSN 0418 - 9833 March 1994 Overrelaxation Algorithm for coupled Gauge - Higgs Systems
In this letter we extent the overrelaxation algorithm, known to be very efficient in gauge theories, to coupled gauge-Higgs systems with a particular emphasis on the update of the radial mode of the Higgs field. Our numerical tests of the algorithm show that the autocorrelation times can be reduced substantially.
متن کاملChiral Gauge Theories and Fermion–Higgs Systems
The amount of work on lattice theory relating to chiral gauge theory has dramatically increased this year with some forty papers in the subject, represented by about twenty contributions to this conference. In contrast, only a handful of papers have been written in the broader field of fermion–Higgs systems without an eye toward chiral gauge theory. Therefore, with one exception, I have decided...
متن کاملMonte Carlo Overrelaxation for SU(N) Gauge Theories
The main bottleneck in Monte Carlo simulations of QCD is the inclusion of light dynamical fermions. For this reason, algorithms for the simulation of Yang-Mills theories have received less attention. The usual combination of Cabibbo-Marinari pseudo-heatbath [1] and Brown-Woch microcanonical overrelaxation [2] of SU(2) subgroups is considered satisfactory. However, the large-N limit of QCD prese...
متن کاملSurface worm algorithm for abelian Gauge-Higgs systems on the lattice
The Prokof’ev Svistunov worm algorithm was originally developed for models with nearest neighbor interactions that in a high temperature expansion are mapped to systems of closed loops. In this work we present the surface worm algorithm (SWA) which is a generalization of the worm algorithm concept to abelian Gauge-Higgs models on a lattice which can be mapped to systems of surfaces and loops (d...
متن کاملAn accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters B
سال: 1994
ISSN: 0370-2693
DOI: 10.1016/0370-2693(94)90951-2